The minmax multidimensional knapsack problem with application to a chance‐constrained problem

In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two‐period, two‐level, chance‐constrained problem with recourse. We show that the MKP is NP‐hard and develop a practically efficient combinatorial algorithm for solving it. We also show that under some reasonable assumptions regarding the operational setting of the logistics problem, the chance‐constrained optimization problem is decomposable into a series of MKPs that are solved separately. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

几种机动目标运动模型的跟踪性能对比

机动目标跟踪是目标定位与跟踪领域研究的难点问题之一.在分析Singer模型、"当前"统计模型、速度估计自适应模型的基础上,对这三种模型及算法进行仿真,给出了上述三种模型跟踪机动目标的精度与实时性的比较结果.     

永磁直线同步电机矢量控制系统建模与实现

针对永磁直线同步电机(PMLSM)的特点,建立PMLSM在dq两相坐标系下的数学模型。介绍了永磁直线同步电机矢量控制系统并给出了硬件和软件的设计思想。通过对控制电流以及电机位置的实验分析,验证了所研究的基于矢量控制的永磁直线同步电机矢量控制方法的有效性。     

球约束凸二次规划的一个算法

针对球约束凸二次规划问题,利用Lagrange对偶将其转化为无约束优化问题,然后运用单纯形法对其求解,获得原问题的最优解。最后,对文中给出的算法给出了论证。     

相变温控混凝土相变储热性能试验研究

混凝土中加入相变材料之后对水化反应产生的热量有一定的吸收,从而对混凝土内部温度有一定的控制作用,这将减少混凝土温度裂缝产生的几率.通过筛选带一定结晶水的硬脂酸、月桂酸和正十二醇的3种有机相变材料,模拟实际大体积混凝土工程来研究不同相变材料的掺量、控温效果.运用计算机软件绘制时间一温度曲线,从中搜寻出最佳的相变材料掺量.     

Terrorism as Method in Nepali Maoist Insurgency, 1996–2016

During the period 1996–2006, the Communist Party of Nepal (Maoist) waged overt people’s war to seize state power and institute a new order that realized the party’s understanding of ‘New Democracy’ as posited by Mao Tse-tung. Contextual shifts led to a crucial strategic turning point in September 2005, when the Maoists agreed to a united front with estranged legal parties to oust the monarchy and establish a republic. Though touted as acceptance of political reintegration, the move was tactical rather than strategic. The party had no intention of supporting a parliamentary version of democracy and thus, 2006–2016, engaged in a covert effort to seize power. Central to this effort was the paramilitary Young Communist League (YCL), the members of which responded to inflammatory party verbiage and exhortations with attacks upon rival political actors. These attacks, academically and legally, were terrorism and offered a salient illustration of intra-state unrestricted warfare. Ultimately, organizational, national, and regional circumstances caused the main Maoist movement to move decisively away from its covert approach. By that time, however, radical splinters had embraced the use of terrorism against rival political actors, creating a situation whereby local politics is yet a dangerous endeavor in certain areas and at certain times.     

基于非线性Kalman滤波的导航系统误差补偿技术

针对非线性非高斯导航系统信息处理问题,采用自组织算法、神经网络和遗传算法等改进传统非线性Kalman滤波算法,构建一种自适应的组合导航系统。应用具有冗余趋势项的自组织算法、Volterra神经网络和遗传算法,建立导航系统误差的非线性预测模型,进而计算得到其预测值;将该预测值与Kalman滤波算法求得的估计值进行比较得到差值,以此监测Kalman滤波算法的工作状态;采用自适应控制方法,在导航系统结构层面改进Kalman滤波算法,构建新型的导航系统误差补偿模型。开展基于导航系统KIND-34的半实物仿真研究,应用所提出的改进方法改善了导航系统误差的补偿效果,提高了组合导航系统的自适应能力和容错能力。     

区域和参数化可靠性灵敏度指标及其解法

针对基于方差的全局可靠性灵敏度指标,分别提出基于方差的区域和参数化可靠性灵敏度指标,以衡量输入变量的取值区域发生变化时或输入变量的方差减小时整个输入变量系统对失效概率不确定性贡献的变化情况。然后从Pearson相关系数的视角分别将所提指标表述成无条件失效域指示函数与固定某一随机输入时的条件失效域指示函数之间的相关系数。在此转换的基础上,提出基于Pearson相关系数的两种求解方法,一种采用蒙特卡洛方法重复抽样进行循环计算,另一种借鉴重要抽样的思想。功能函数的计算样本可重复使用而不增加任何额外的计算代价,故后者大大提高了求解所提区域和参数化灵敏度指标的计算效率。算例结果验证了所提指标的合理性,同时也证明了所提方法的准确性与高效性。     

纹理影像特征选择及K-means聚类优化方法

Gabor变换和K-means算法是最为常用的纹理分析方法。然而,采用Gabor变换得到的纹理特征向量具有较高的维数,影响算法的运行效率;K-means算法也易受初始类中心的影响而导致分类精度下降。因此,通过Relief算法对采用Gabor变换所提取的纹理特征进行选择,得到合适的纹理特征子集。进一步采用差分进化算法,对K-means算法的聚类中心进行优化从而提高纹理识别精度和效率。实验结果表明:提出的方法所需用到的纹理特征向量的维数相对于原始特征集有大幅降低,较之基本的K-means算法,纹理识别的精度也有较明显的提高。